Optimal average message passing density in Moore graphs
نویسندگان
چکیده
منابع مشابه
Parameterless Optimal Approximate Message Passing
Iterative thresholding algorithms are well-suited for high-dimensional problems in sparse recovery and compressive sensing. The performance of this class of algorithms depends heavily on the tuning of certain threshold parameters. In particular, both the final reconstruction error and the convergence rate of the algorithm crucially rely on how the threshold parameter is set at each step of the ...
متن کاملMAP Estimation, Message Passing, and Perfect Graphs
Efficiently finding the maximum a posteriori (MAP) configuration of a graphical model is an important problem which is often implemented using message passing algorithms. The optimality of such algorithms is only well established for singly-connected graphs and other limited settings. This article extends the set of graphs where MAP estimation is in P and where message passing recovers the exac...
متن کاملDiscrete geometric analysis of message passing algorithm on graphs
We often encounter probability distributions given as unnormalized products of non-negative functions. The factorization structures of the probability distributions are represented by hypergraphs called factor graphs. Such distributions appear in various fields, including statistics, artificial intelligence, statistical physics, error correcting codes, etc. Given such a distribution, computatio...
متن کاملA Message Passing Model for Communication on Random Regular Graphs
| Randomized routing strategies are applied to avoid worst-case communication patterns on communication networks used for parallel computers. Instead of a randomized routing strategy on a regular communication network, the random-ization of the network itself is investigated in this paper. A model to describe properties of random regular graphs is presented. With the results of the model it is ...
متن کاملThe Entropy Message Passing: A New Algorithm Over Factor Graphs
Message passing over a factor graph can be considered as a generalization of the many well-known algorithms for an efficient marginalization of multivariate functions. The specific instance of the algorithm is obtained by selection of an appropriate commutative semiring for the range of the function to be marginalized. Some of the examples are the Viterbi algorithm, obtained on a max-product se...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Mathematics Letters
سال: 1994
ISSN: 0893-9659
DOI: 10.1016/0893-9659(94)90075-2